Transmission Fault-tolerance of Iterated Line Digraphs Transmission Fault-tolerance of Iterated Line Digraphs Transmission Fault-tolerance of Iterated Line Digraphs

نویسندگان

  • Shitou Han
  • Hung Q. Ngo
  • Lu Ruan
  • Ding-Zhu Du
چکیده

Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general result on super line-connectivity based on the line digraph iteration which improves and generalizes several existing results in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transmission fault-tolerance of iterated line digraphs

Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general result on super line-connectivity based on the line digraph iteration which improves and generalizes several existing results in the literature.

متن کامل

Diameter vulnerability of iterated line digraphs in terms of the girth

Iterated line digraphs arise naturally in designing fault tolerant systems. Diameter vulnerability measures the increase in diameter of a digraph when some of its vertices or arcs fail. Thus, the study of diameter vulnerability is a suitable approach to the fault tolerance of a network. In this article we present some upper bounds for diameter vulnerability of iterated line digraphs LkG. Our bo...

متن کامل

New bounds on the diameter vulnerability of iterated line digraphs

Iterated line digraphs have some good properties in relation to the design of interconnection networks. The diameter vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a ,xed number of vertices or arcs. This parameter is related to the fault-tolerance of interconnection networks. In this work, we introduce some new parameters in order to ,nd new bounds fo...

متن کامل

Radii and centers in iterated line digraphs

We show that the out-radius and the radius grow linearly, or “almost” linearly, in iterated line digraphs. Further, iterated line digraphs with a prescribed out-center, or a center, are constructed. It is shown that not every line digraph is admissible as an out-center of line digraph.

متن کامل

Analysis of Fault Tolerance in Cayley Digraphs Using Forbidden Faulty Sets Parallel and Distributed Computing Laboratory Analysis of Fault Tolerance in Cayley Digraphs Using Forbidden Faulty Sets

PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL PDCL Abstract The connectivity and fault tolerance measures of various interconnection networks assume that all the neighboring nodes of any node could be faulty at the same time. The forbidden faulty set analysis of restricted connectivity and fault tolerance assumes that a set of nodes cannot be fau...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000